Lowering HPF Procedure Interface to a Canonical Representation

نویسندگان

  • Jan Borowiec
  • Arthur H. Veen
چکیده

Handling the procedure interface in an HPF compiler is complex due to the many possible combinations of Fortran 90/HPF properties of an actual array argument and its associated dummy argument. This paper describes an algorithm that reduces this complexity by mapping all the combinations of properties to a small set of canonical Internal Representations. These internal representations as well as the necessary run-time descriptors are also described. The algorithm has been implemented in the commercial HPF compiler produced by the Prepare project.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Canonical representation for approximating solution of fuzzy polynomial equations

In this paper, the concept of canonical representation is proposed to find fuzzy roots of fuzzy polynomial equations. We transform fuzzy polynomial equations to system of crisp polynomial equations, this transformation is perform by using canonical representation based on three parameters Value, Ambiguity and Fuzziness. 

متن کامل

Rings of Singularities

This paper is a slightly revised version of an introduction into singularity theory corresponding to a series of lectures given at the ``Advanced School and Conference on homological and geometrical methods in representation theory'' at the International Centre for Theoretical Physics (ICTP), Miramare - Trieste, Italy, 11-29 January 2010. We show how to associate to a triple of posit...

متن کامل

Transforming Data - parallel Fortran 90 / HPF Constructs Into aUniform Internal Representation

As a part of the PREPARE High Performance Fortran compiler, a component has been designed and implemented which transforms an abstract, high-level internal representation of For-tran90/HPF programs to a medium-level internal form. Normalizations and pre-optimizations are applied to simplify the task of the subsequent compiler phases. This paper describes a selection of translation techniques fo...

متن کامل

An Explicit Basis of Lowering Operators for Irreducible Representations of Unitary Groups

The representation theory of the unitary groups is of fundamental significance in many areas of physics and chemistry. In order to label states in a physical system with unitary symmetry, it is necessary to have explicit bases for the irreducible representations. One systematic way of obtaining bases is to generalize the ladder operator approach to the representations of SU(2) by using the form...

متن کامل

Realization of an HPF Interface to ScaLAPACK with Redistributions

The High Performance Fortran (HPF) programming language provides the data parallel programming paradigm for high performance architectures with diierent hierarchies of memory. HPF programs are much easier to write and to read than conventional message passing programs. Unfortunately, the data parallel programming paradigm is not suucient for all kind of applications and message passing programs...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997